Computational hardness assumptions - PDFSEARCH.IO - Document Search Engine

Computational hardness assumptions
Results: 76

#	Item
21	THE FACTORING DEAD: PREPARING FOR THE CRYPTOPOCALYPSE Javed Samuel — javed[at]isecpartners[dot]com iSEC Partners, Inc 123 Mission Street, Suite 1020 San Francisco, CA 94105 Add to Reading List Source URL: www.isecpartners.com Language: English - Date: 2014-04-02 07:42:28 Integer factorization algorithms Finite fields Logarithms Computational hardness assumptions Discrete logarithm Integer factorization Quadratic sieve XTR General number field sieve Abstract algebra Cryptography Mathematics
22	Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-01-14 14:00:36 Cryptographic protocols Finite fields Diffie–Hellman problem Oblivious transfer RSA XTR Decisional Diffie–Hellman assumption Decision Linear assumption Diffie–Hellman key exchange Cryptography Public-key cryptography Computational hardness assumptions
23	Improvement of Ma ni ke ta l . Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-12-09 05:56:33 Computational hardness assumptions Diffie–Hellman key exchange Diffie–Hellman problem Weil pairing ID-based encryption Password authentication protocol Public-key cryptography Boneh/Franklin scheme Cryptography Cryptographic protocols Finite fields
24	Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2009-09-20 23:35:30 Group theory Finite fields Computational hardness assumptions Logarithms Discrete logarithm Diffie–Hellman problem Baby-step giant-step Elliptic curve Diffie–Hellman key exchange Abstract algebra Cryptography Mathematics
25	Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders Safuat Hamdy Bodo Möller Add to Reading List Source URL: www.bmoeller.de Language: English - Date: 2006-01-02 00:23:19 Integer factorization algorithms Finite fields Computational hardness assumptions Algebraic number theory Group theory XTR Discrete logarithm Quadratic sieve Integer factorization Abstract algebra Mathematics Algebra
26	The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions Brent Waters† University of Texas at Austin Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-06 19:27:51 Mathematics Multilinear algebra Cryptography Finite fields Decision Linear assumption Boneh/Franklin scheme Group theory Bilinear map Decisional Diffie–Hellman assumption Algebra Computational hardness assumptions Abstract algebra
27	Two novel applications of bilinear groups to ABE encryption Riccardo Longo Department of Mathematics, University of Trento, Italy Chiara Marcolla Department of Mathema Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-12 11:38:03 Finite fields Cryptographic protocols Diffie–Hellman problem Pairing-based cryptography Hellman Diffie–Hellman key exchange Discrete logarithm Whitfield Diffie BLS Cryptography Abstract algebra Computational hardness assumptions
28	CS355: Topics in cryptography Spring 2014 Assignment #1 Due: Tuesday, May. 13, 2014. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-05-07 00:53:37 Finite fields Cryptographic protocols Computational hardness assumptions Public-key cryptography Diffie–Hellman problem Diffie–Hellman key exchange Digital signature PP One-way function Cryptography Abstract algebra Mathematics
29	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2007-01-06 01:59:49 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
30	CS255: Cryptography and Computer Security Winter 2003 Assignment #3 Due: Monday, March 3rd, 2003 at 5pm in CS255 box next to Gates 182. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2003-02-18 23:13:10 Finite fields Computational hardness assumptions Diffie–Hellman key exchange ElGamal encryption XTR RSA Diffie–Hellman problem Computational Diffie–Hellman assumption Discrete logarithm Cryptography Public-key cryptography Cryptographic protocols

UPDATE